Conic convex programming and self-dual embedding
نویسندگان
چکیده
منابع مشابه
A New Self-Dual Embedding Method for Convex Programming
In this paper we introduce a conic optimization formulation for inequality-constrained convex programming, and propose a self-dual embedding model for solving the resulting conic optimization problem. The primal and dual cones in this formulation are characterized by the original constraint functions and their corresponding conjugate functions respectively. Hence they are completely symmetric. ...
متن کاملConic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
We introduce a first-order method for solving very large convex cone programs. Themethod uses an operator splittingmethod, the alternating directionsmethod of multipliers, to solve the homogeneous self-dual embedding, an equivalent feasibility problem involving finding a nonzero point in the intersection of a subspace and a cone. This approach has several favorable properties. Compared to inter...
متن کاملDuality and Self-duality for Conic Convex Programming
This paper considers the problem of minimizing a linear function over the intersection of an aane space with a closed convex cone. In the rst half of the paper, we give a detailed study of duality properties of this problem and present examples to illustrate these properties. In particular, we introduce the notions of weak/strong feasibility or infeasibility for a general primal-dual pair of co...
متن کاملOn implementation of a self-dual embedding method for convex programming
In this paper, we implement Zhang’s method [22], which transforms a general convex optimization problem with smooth convex constraints into a convex conic optimization problem and then apply the techniques of self-dual embedding and central path following for solving the resulting conic optimization model. A crucial advantage of the approach is that no initial solution is required, and the meth...
متن کاملAdvances in convex optimization: conic programming
During the last two decades, major developments in convex optimization were focusing on conic programming, primarily, on linear, conic quadratic and semidefinite optimization. Conic programming allows to reveal rich structure which usually is possessed by a convex program and to exploit this structure in order to process the program efficiently. In the paper, we overview the major components of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 2000
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556780008805800